Tricritical points in random combinatorics: the (2+ p)-SAT case
نویسندگان
چکیده
The (2 + p)-satisfiability (SAT) problem interpolates between different classes of complexity theory and is thought to be of basic interest in understanding the onset of typical case complexity in random combinatorics. In this paper, a tricritical point in the phase diagram of the random (2 + p)-SAT problem is analytically computed using the replica approach and found to lie in the range 5 6 p0 6 0.416. These bounds on p0 are in agreement with previous numerical simulations and rigorous results.
منابع مشابه
Conditional Inapproximability and Limited Independence
Understanding the theoretical limitations of efficient computation is one of the most fundamental open problems of modern mathematics. This thesis studies the approximability of intractable optimization problems. In particular, we study so-called Max CSP problems. These are problems in which we are given a set of constraints, each constraint acting on some k variables, and are asked to find an ...
متن کاملBounds on the Satisfiability Threshold for Power Law Distributed Random SAT
Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. The worst-case hardness of SAT lies at the core of computational complexity theory. The averagecase analysis of SAT has triggered the development of sophisticated rigorous and non-rigorous techniques for analyzing random structures. Despite a long line of research and substantial progress, nearly all...
متن کاملTricritical Points in the Sherrington-Kirkpatrick Model in the Presence of Discrete Random Fields
The infinite-range-interaction Ising spin glass is considered in the presence of an external random magnetic field following a trimodal (three-peak) distribution. Such a distribution corresponds to a bimodal added to a probability p0 for a field dilution, in such a way that at each site the field hi obeys P (hi) = p+δ(hi−h0)+p0δ(hi)+p−δ(hi+h0). The model is studied through the replica method an...
متن کاملSolving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the algorithm solves a more general class of problems, namely binary 2-variable constraint satisfaction problems. In addition to Max Cut, such Max 2-CSPs encompass Max Dicut, Max 2-Lin, Max 2-Sat, Max-Ones-2-Sat, maximum independen...
متن کاملStrong Refutation Heuristics for Random k-SAT
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is at most 1−2−k+o(1) as m/n →∞ almost surely. In this paper, we deal with the corresponding algorithmic strong refutation problem: given a random k-SAT formula, can we find a certificate that the fraction of satisfiable clauses is at most 1 −...
متن کامل